Non-geometric cospectral mates of line graphs with a linear representation
نویسندگان
چکیده
For an incidence geometry $${\mathcal G}= ({\mathcal P}, {\mathcal L}, {\text {I}})$$ with a linear representation T}_2^*({\mathcal K})$$ , we apply WQH switching to construct non-geometric graph $$\Gamma '$$ cospectral the line $$ of G}$$ . As application, show that for $$h \ge 2$$ and $$0< m < h$$ there are strongly regular graphs parameters $$(v, k, \lambda \mu ) = (2^{2\,h} (2^{m+h}+2^m-2^h), 2^h (2^h+1)(2^m-1), (2^{m+1}-3), (2^m-1))$$ which not point partial geometries order $$(s,t,\alpha ((2^h+1)(2^m-1), 2^h-1, 2^m-1)$$
منابع مشابه
Non-Isomorphic Graphs with Cospectral Symmetric Powers
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...
متن کاملA note on non-R-cospectral graphs
Two graphs G and H are called R-cospectral if A(G)+yJ and A(H)+yJ (where A(G), A(H) are the adjacency matrices of G and H, respectively, J is the all-one matrix) have the same spectrum for all y ∈ R. In this note, we give a necessary condition for having R-cospectral graphs. Further, we provide a sufficient condition ensuring only irrational orthogonal similarity between certain cospectral grap...
متن کاملGraphs cospectral with starlike trees
A tree which has exactly one vertex of degree greater than two is said to be starlike. In spite of seemingly simple structure of these trees, not much is known about their spectral properties. In this paper, we introduce a generalization of the notion of cospectrality called m-cospectrality which turns out to be useful in constructing cospectral graphs. Based on this, we construct cospectral ma...
متن کاملconnected graphs cospectral with a friendship graph
let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...
متن کاملEnumeration of cospectral graphs
We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry
سال: 2023
ISSN: ['0047-2468', '1420-8997']
DOI: https://doi.org/10.1007/s00022-023-00672-8